Towards Symbolic Analysis of Graph Transformation Systems
نویسنده
چکیده
Graph transformation has recently become more and more popular as a general, rule-based visual specification paradigm to formally capture the operational semantics of modeling languages based on metamodeling techniques as demonstrated, by benchmark applications focusing on the formal treatment of the Unified Modeling Language (UML). In the paper, we propose a model checking-based verification approach for such modeling languages by automatically transforming them into SAL specifications [1] to provide access for a combination of symbolic analysis techniques.
منابع مشابه
Towards Symbolic Analysis of Model Transformations
As the Unified Modeling Language is evolving into a family of languages with individually specified semantics, there is an increasing need for highly automated and provenly correct model transformations that assure the integration of local views of the system (in the form of different diagrams) into a consistent global view. Graph transformation provides an easy-to-understand visual specificati...
متن کاملModelling Service-Oriented Computing with Temporal Symbolic Graph Transformation Systems
In this paper, we present a novel semantics for an essential aspect of service-oriented computing: the mechanism through which systems evolve through a symbiosis of state transformations and run-time service discovery and binding. The semantics is based on a new notion of temporal symbolic graph-transformation systems: in temporal symbolic graphs, interfaces can be specified using temporal logi...
متن کاملENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH
Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملTowards Local Confluence Analysis for Amalgamated Graph Transformation
Amalgamated graph transformation allows to define schemes of rules coinciding in common core activities and differing over additional parallel independent activities. Consequently, a rule scheme is specified by a kernel rule and a set of extending multi-rules forming an interaction scheme. Amalgamated transformations have been increasingly used in various modeling contexts. Critical Pair Analys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002